منابع مشابه
On the Automorphism Groups of Strongly Regular Graphs II
We derive strong constraints on the automorphism groups of strongly regular (SR) graphs, resolving old problems motivated by Peter Cameron’s 1981 description of large primitive groups. Trivial SR graphs are the disjoint unions of cliques of equal size and their complements. Graphic SR graphs are the line-graphs of cliques and of regular bipartite cliques (complete bipartite graphs with equal pa...
متن کاملOn the Automorphism Groups of Strongly Regular Graphs
We derive strong structural constraints on the automorphism groups of strongly regular (s. r.) graphs, giving a surprisingly strong answer to a decades-old problem, with tantalizing implications to testing isomorphism of s. r. graphs, and raising new combinatorial challenges. S. r. graphs, while not believed to be Graph Isomorphism (GI) complete, have long been recognized as hard cases for GI, ...
متن کاملStrongly Bounded Groups and Infinite Powers of Finite Groups
We define a group as strongly bounded if every isometric action on a metric space has bounded orbits. This latter property is equivalent to the so-called uncountable strong cofinality, recently introduced by Bergman. Our main result is that G is strongly bounded when G is a finite, perfect group and I is any set. This strengthens a result of Koppelberg and Tits. We also prove that ω1-existentia...
متن کاملOn Strongly $H_{v}$-groups
The largest class of hyperstructures is the one which satisfies the weak properties; these are called $H_{v}$-structures. In this paper we introduce a special product of elements in $H_{v}$-group $H$ and define a new class of $H_{v}$-groups called strongly $H_{v}$-groups. Then we show that in strongly $H_{v}$-groups $beta=beta^{ast}$. Also we express $theta$-hyperoperation and investigat...
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2006
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm105-1-7